Cryptanalysis of the Two-Dimensional Circulation Encryption Algorithm

نویسندگان

  • Christophe De Cannière
  • Joseph Lano
  • Bart Preneel
چکیده

In symmetric-key cryptography, two parties share a secret key K to encrypt messages using a cipher. Symmetric encryption techniques are used to efficiently encrypt data. Two common types of ciphers are commonly used nowadays: block ciphers and stream ciphers. Block ciphers encrypt blocks of data (typically 64 or 128 bits) in a fixed key-dependent way. The design of block ciphers is a well-studied area of research. The best known block ciphers are the Data Encryption Standard (DES) [2] and the Advanced Encryption Standard (AES) [3]. In the past decade, many new attacks on block ciphers have emerged, the most important ones being differential [4] and linear [5] cryptanalysis. Differential cryptanalysis is an example of a chosen-plaintext attack, while linear cryptanalysis is a known-plaintext attack. A good design should at least be resistant to these attacks. Stream ciphers, on the other hand, generate a pseudorandom key stream independent of the plaintext. This key stream is then used to encrypt the plaintext character per character in a time-varying way. In this paper, we will study the security of the recently published two-dimensional circulation encryption algorithm (TDCEA) [1]. This design can be seen as a block cipher, but it also has some properties of a stream cipher. It encrypts blocks of 64 bits at a time by combining each block with the secret key. The outline of this paper is as follows. In Section 2, we briefly describe TDCEA. In Section 3, we study the security of TDCEA. We show several flaws in the algorithm and describe a known-plaintext attack that breaks the cipher in less than 10 seconds on a 1.5GHz PC. We also explain why we believe that it will not be possible to improve the design to be cryptographically sound, as TDCEA lacks many of the desirable properties of a state-of-the-art symmetric encryption algorithm. In Section 4, we address the tradeoffs that need to be made between performance and security of a design. We then discuss the use of concepts from chaos theory in cryptography in Section 5, and conclude in Section 6.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Performance Survey of Meta-Heuristic And Brute-Force Search Algorithms to Cryptanalysis The SDES Encryption Algorithm

For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algori...

متن کامل

Cryptanalysis of GSM encryption algorithm A5/1

The A5/1 algorithm is one of the most famous stream cipher algorithms used for over-the-air communication privacy in GSM. The purpose of this paper is to analyze several weaknesses of A5/1, including an improvement to an attack and investigation of the A5/1 state transition. Biham and Dunkelman proposed an attack on A5/1 with a time and data complexity of 239.91and 221.1, ...

متن کامل

Cryptanalysis of some first round CAESAR candidates

ΑΕS _ CMCCv₁, ΑVΑLΑNCHEv₁, CLΟCv₁, and SILCv₁ are four candidates of the first round of CAESAR. CLΟCv₁ is presented in FSE 2014 and SILCv₁ is designed upon it with the aim of optimizing the hardware implementation cost. In this paper, structural weaknesses of these candidates are studied. We present distinguishing attacks against ΑES  _ CMCCv₁ with the complexity of two queries and the success ...

متن کامل

Artemia: a family of provably secure authenticated encryption schemes

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

متن کامل

Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis

Linear cryptanalysis and diierential cryptanalysis are two recently introduced, powerful methodologies for attacking private-key block ciphers. In this paper, we examine the application of these two cryptanalysis techniques to a CAST-like encryption algorithm based on randomly generated s-boxes. It is shown that, when randomly generated substitution boxes (s-boxes) are used in a CAST-like algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • EURASIP J. Adv. Sig. Proc.

دوره 2005  شماره 

صفحات  -

تاریخ انتشار 2005